翻訳と辞書 |
Pile (abstract data type) : ウィキペディア英語版 | Pile (abstract data type)
In computer science, a pile is an abstract data type for storing data in a loosely ordered way. There are two different usages of the term; one refers to an ordered deque, the other to an improved heap. ==Ordered deque==
The first version combines the properties of the deque and a priority queue and may be described as an ordered deque. An item may be added to the head of the list if the new item is valued less than or equal to the current head or to the tail of the list if the new item is greater than or equal to the current tail. Elements may be removed from both the head and the tail.〔Art S. Kagel, "(Pile )", in ''Dictionary of Algorithms and Data Structures'' (), Paul E. Black, ed., National Institute of Standards and Technology, assessed September 27, 2007.〕 Piles of this kind are used in the "UnShuffle sort" sorting algorithm.
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Pile (abstract data type)」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|